Program Analysis with Dynamic Precision Adjustment ∗ Dirk Beyer Simon Fraser University, Canada Thomas A. Henzinger EPFL, Switzerland

Source URL: www.sosy-lab.org

• Formal methods
• Mathematical logic
• Function
• Predicate transformer semantics
• Floating point
• Abstract interpretation
• Predicate
• Quantification
• Prime-counting function
• Mathematics
• Logic
• Semantics

Information Parallax F.A. Grootjen and Th.P. van der Weide∗ Abstract To effectively use and exchange information among AI systems, a formal specification of the representation of their shared domain of discourse – ca

Source URL: franc.grootjen.nl

• Information science
• Knowledge representation
• Technical communication
• Semantic Web
• Information retrieval
• Natural language processing
• Ontology
• Interpretation
• Function
• Science
• Mathematics
• Mathematical logic

Towards the Industrial Scale Development of Custom Static Analyzers John Anton, Eric Bush, Allen Goldberg, Klaus Havelund, Doug Smith, Arnaud Venet Kestrel Technology LLC 4984 El Camino Real #230 Los Altos, CA 94022

Source URL: www.agoldberg.org

• Computer programming
• Logic in computer science
• Program analysis
• Abstract interpretation
• Static program analysis
• Astrée
• Formal verification
• Runtime verification
• Programming language
• Software engineering
• Computing
• Formal methods

Bounds Analysis by Abstract Interpretation∗ Xiaolei Qian Computer Science Laboratory SRI International [removed]

Source URL: www.agoldberg.org

• Abstract interpretation
• Valuation
• FO
• Function
• ALGOL 68
• Mathematics
• Algebra
• Algebraic structures

Semantic bounds for everyday language* MARCIN MOSTOWSKI and JAKUB SZYMANIK Abstract We consider the notion of everyday language. We claim that everyday language is semantically bounded by the properties expressible in t

Source URL: www.jakubszymanik.com

• Metalogic
• Model theory
• Semantics
• Formal languages
• First-order logic
• Interpretation
• Function
• Quantification
• Well-formed formula
• Logic
• Mathematical logic
• Predicate logic

Internalization of the Groupoid Interpretation of Homotopy Type Theory Matthieu Sozeau1,2 and Nicolas Tabareau1,3 1 πr2 and Ascola teams, INRIA Preuves, Programmes et Syst`emes (PPS)

Source URL: mattam.org

• Homotopy theory
• Groupoid
• Equivalence relation
• Group action
• Path
• Homotopy
• Functor
• Adjoint functors
• 2-group
• Abstract algebra
• Topology
• Mathematics

arXiv:0804.3914v2 [cs.LO] 3 Jun[removed]Reasoning in Abella about Structural Operational Semantics Specifications Andrew Gacek1 Dale Miller2 Gopalan Nadathur1 Abstract

Source URL: arxiv.org

• Model theory
• Formal languages
• Theoretical computer science
• Interpretation
• Philosophy of mind
• Semantics
• Lambda calculus
• Structure
• Function
• Mathematics
• Mathematical logic
• Logic

Environment Analysis of Higher-Order Languages A Doctoral Dissertation by Matthew Might Georgia Institute of Technology

Source URL: matt.might.net

• Computer programming
• Automatic memory management
• Data types
• Algorithm
• Mathematical logic
• Theoretical computer science
• Abstract interpretation
• Garbage collection
• Reference counting
• Computing
• Software engineering
• Memory management

Abstract interpretation of concurrent, higherorder programs Matt Might University of Utah matt.might.net @mattmight

Source URL: matt.might.net

Entangled abstract domains for higher-order programs Shuying Liang Matthew Might

Source URL: matt.might.net

• Mathematics
• Structure
• Abstract interpretation
• Interpretation
• Cardinal number
• Metaphilosophy
• Model theory
• Logic
• Symbol